Algorithms on Graphs: Part III Shortest Path Problems
نویسنده
چکیده
Path in a graph. The shortest path weight for a pair (u, v) of edges is defined as: δ(u, v) = ∞, if there is no path from u to v; δ(u, v) = min(w(p)): p connects u to v. A shortest path between u and v is any path p between them, such that w(p) = δ(u, v). Single-source shortest path problem. Given a graph G and a vertex v ∈ V , find the shortest path from v to every other node in the graph. Single-destination shortest path problem. Given a graph G and a vertex v ∈ V , find the shortest path to v from every other node in the graph. Single-pair shortest path problem. Given a graph G and a pair u and v of nodes, find the shorest path between them.
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملWhat Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? —Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples—
This paper analyzes what structural features of graph problems allow efficient parallel algorithms. We survey some parallel algorithms for typical problems on three kinds of graphs, outerplanar graphs, trapezoid graphs and in-tournament graphs. Our results on the shortest path problem, the longest path problem and the maximum flow problem on outerplanar graphs, the minimum-weight connected domi...
متن کاملImproved algorithms for replacement paths problems in restricted graphs
We present near-optimal algorithms for two problems related to finding the replacement paths for edges with respect to shortest paths in sparse graphs. The problems essentially study how the shortest paths change as edges on the path fail, one at a time. Our technique improves the existing bounds for these problems on directed acyclic graphs, planar graphs, and non-planar integer-edge-weighted ...
متن کاملPath Problems in Temporal Graphs
Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient or even flawed in a temporal graph, as the temporal information determines the order of activities along any path. In this paper, we show the shortcomings of classic shortest path in a temporal graph, and study various concepts of “shortest” path for temporal gr...
متن کاملA O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs
In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points—source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very idea and presents an algorithms for calculating shortest path for (i) nonnegative weighted undirected...
متن کامل